Probabilistic framework for epidemic spreading in complex networks
نویسندگان
چکیده
The discovery of the important role played by the complex connectivity structure between individuals has lead to an increasing interest in the analysis of epidemic spreading in complex networks. Here we propose a discrete-time formulation of the problem of contact-based epidemic spreading, within the context of susceptible-infected-susceptible epidemic models. The proposed equations establish the relations between the probabilities of infection of individual nodes. They can be easily solved by iteration, showing an almost perfect agreement with Monte Carlo experiments throughout the whole phase diagram. This framework also allows the determination of the epidemic threshold and, unlike heterogeneous mean-field approaches, it is valid for any finite-size and weighted network.
منابع مشابه
Energy-Aware Probabilistic Epidemic Forwarding Method in Heterogeneous Delay Tolerant Networks
Due to the increasing use of wireless communications, infrastructure-less networks such as Delay Tolerant Networks (DTNs) should be highly considered. DTN is most suitable where there is an intermittent connection between communicating nodes such as wireless mobile ad hoc network nodes. In general, a message sending node in DTN copies the message and transmits it to nodes which it encounters. A...
متن کاملNonperturbative heterogeneous mean-field approach to epidemic spreading in complex networks.
Since roughly a decade ago, network science has focused among others on the problem of how the spreading of diseases depends on structural patterns. Here, we contribute to further advance our understanding of epidemic spreading processes by proposing a nonperturbative formulation of the heterogeneous mean-field approach that has been commonly used in the physics literature to deal with this kin...
متن کاملGEMFsim: A stochastic simulator for the generalized epidemic modeling framework
The recently proposed generalized epidemic modeling framework (GEMF) [1] lays the groundwork for systematically constructing a broad spectrum of stochastic spreading processes over complex networks. This article builds an algorithm for exact, continuous-time numerical simulation of GEMF-based processes. Moreover the implementation of this algorithm, GEMFsim, is available in popular scientific p...
متن کامل0 Epidemic spreading in scale - free networks
The Internet, as well as many other networks, has a very complex connectivity recently modeled by the class of scale-free networks. This feature, which appears to be very efficient for a communications network, favors at the same time the spreading of computer viruses. We analyze real data from computer virus infections and find the average lifetime and prevalence of viral strains on the Intern...
متن کاملEpidemic spreading in scale-free networks.
The Internet has a very complex connectivity recently modeled by the class of scale-free networks. This feature, which appears to be very efficient for a communications network, favors at the same time the spreading of computer viruses. We analyze real data from computer virus infections and find the average lifetime and persistence of viral strains on the Internet. We define a dynamical model ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010